Gasoline Blending and Distribution Scheduling: An MILP Model
نویسندگان
چکیده
Synonyms Indices i = orders j = productstock tanks s = products k = components l = component tanks n = event points Sets I = orders Ij = orders which can be performed in productstock tank j Is = orders which order product s J = productstock tanks Ji = productstock tanks which are suitable for performing order i Js = productstock tanks which can store product s N = event points within the time horizon S = products Sj = products which can be stored in productstock tank j K = components Kl = components which can be stored in componentstock tank l L = componentstock tanks Lk = componentstock tanks which can store component k Parameters Vmax(j) = maximum capacity of productstock tank j Vmin(j) = minimum amount of product stored in tank j if tank j is utilized Vinitial(j,s) = amount of product s stored in tank j initially Vin(l,k) = amount of component k stored in comp. tank l initially Vcomp(l) = maximum capacity of comp. tank l Recipe(s,k) = the proportion of component k to in product s l(i) = lifting rate of order i Bflow = flow rate of product being produced and transferred to productstock tanks Prod srt(i) = time by which order i can start Prod end(i) = time by which order i is due U1 = lower bound on the amount of product lifted U2 = upper bound on the amount of product lifted U3 = upper bound of a small-size order U4 = upper bound of a medium-size order U5 = lower bound of a large-size order flowmin = minimum flow rate of component tanks flowmax = maximum flow rate of component tanks H = time horizon Variables
منابع مشابه
Optimization Techniques for Blending and Scheduling of Oil-refinery Operations
This paper presents a novel MILP formulation that addresses the simultaneous optimization of the short-term scheduling and blending problem in oil-refinery applications. Depending on the problem characteristics as well as the required flexibility in the solution, the model can be based on either a discrete or a continuous-time domain representation. In order to preserve the model’s linearity, a...
متن کاملA simultaneous optimization approach for off-line blending and scheduling of oil-refinery operations
This paper presents a novel MILP-based method that addresses the simultaneous optimization of the off-line blending and the short-term scheduling problem in oil-refinery applications. Depending on the problem characteristics as well as the required flexibility in the solution, the model can be based on either a discrete or a continuous-time domain representation. In order to preserve the model’...
متن کاملAn Milp Formulation for the Scheduling of Multiproduct Pipeline Systems
Pipelines provide an economic mode of fluid transportation for petroleum systems, specially when large amounts of these products have to be pumped for large distances. The system discussed in this paper is composed of a petroleum refinery, a multiproduct pipeline connected to several depots and the corresponding consumer markets that receive large amounts of gasoline, diesel, LPG and aviation f...
متن کاملAn Improved Optimization Model for Scheduling of a Multi-Product Tree-Like Pipeline
In the petroleum supply chain, oil refined products are often delivered to distribution centers by pipelines since they provide the most reliable and economical mode of transportation over large distances. This paper addresses the optimal scheduling of a complex pipeline network with multiple branching lines. The main challenge is to find the optimal sequence and time of product injections/deli...
متن کاملUsing CLP and MILP for Scheduling Commodities in a Pipeline
This paper addresses the problem of developing an optimization structure to aid the operational decision-making in a real-world pipeline scenario. The pipeline connects an inland refinery to a harbor, conveying different types of commodities (gasoline, diesel, kerosene, alcohol, liquefied petroleum gas, etc). The scheduling of activities has to be specified in advance by a specialist, who must ...
متن کاملA Stochastic Model for Prioritized Outpatient Scheduling in a Radiology Center
This paper discussed the scheduling problem of outpatients in a radiology center with an emphasis on priority. To more compatibility to real-world conditions, we assume that the elapsed times in different stages to be uncertain that follow from the specific distribution function. The objective is to minimize outpatients’ total spent time in a radiology center. The problem is formulated as a fle...
متن کامل